Hidden veri cation for computational mathematics
نویسندگان
چکیده
We present hidden veri cation as a means to make the power of computational logic available to users of computer algebra systems while shielding them from its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures to attempt proofs of continuity, convergence and di erentiability for functions in this class. These are called directly from Maple by a simple pipe-lined interface. Hence we are able to support the analysis of di erential equations in Maple by direct calls to PVS for: result re nement and veri cation, discharge of veri cation conditions, harnesses to ensure more reliable di erential equation solvers, and veri able look-up tables.
منابع مشابه
Discriminative utterance verification using multiple confidence measures
This paper proposes an utterance veri cation system for hidden Markov model (HMM) based automatic speech recognition systems. A veri cation objective function, based on a multi-layer-perceptron (MLP), is adopted which combines con dence measures from both the recognition and veri cation models. Discriminative minimum veri cation error training is applied for optimizing the parameters of the MLP...
متن کاملAudio-Visual Speaker Veri cation using Continuous Fused HMMs
This paper examines audio-visual speaker veri cation using a novel adaptation of fused hidden Markov models, in comparison to output fusion of individual classi ers in the audio and video modalities. A comparison of both hidden Markov model (HMM) and Gaussian mixture model (GMM) classi ers in both modalities under output fusion shows that the choice of audio classi er is more important than vid...
متن کاملThe Temporal Specification and . . .
We extend the speci cation language of temporal logic, the corresponding veri cation framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems: qualitative fairness requirements are superseded by quantita...
متن کاملVerifying a smart design of TCAP a synergetic experience
An optimisation of the SS No. 7 Transport Capabilities Procedures is veri ed by specifying both the original and the optimised TCAP in CRL, generating transition systems for both using the CRL tool set, and checking weak bisimulation equivalence of the two using the C sar/Ald ebaran tool set, these steps being part of a iterative process of speci cation, re nement and veri cation. As a result, ...
متن کاملA code-independent technique for computational veri cation of uid mechanics and heat transfer problems
This paper addresses the challenge of Solution Veri cation (SV) and accuracy assessment for computing complex Partial Di erential Equation (PDE) model. Our goal is to provide a postprocessing software infrastructure that can be connected to any existing numerical simulation software, for example, widely used commercial applications such as ADINA, Ansys, Fluent, Numeca, Star-CD etc... and provid...
متن کامل